Monotone Circuits: One-Way Functions versus Pseudorandom Generators
نویسندگان
چکیده
We study the computability of one-way functions and pseudorandom generators by monotone circuits, showing a substantial gap between the two: On one hand, there exist one-way functions that are computable by (uniform) polynomial-size monotone functions, provided (of course) that one-way functions exist at all. On the other hand, no monotone function can be a pseudorandom generator.
منابع مشابه
On derandomization and average-case complexity of monotone functions
We investigate whether circuit lower bounds for monotone circuits can be used to derandomize randomized monotone circuits. We show that, in fact, any derandomization of randomized monotone computations would derandomize all randomized computations, whether monotone or not. We prove similar results in the settings of pseudorandom generators and average-case hard functions – that a pseudorandom g...
متن کاملGeneral Pseudo-random Generators from Weaker Models of Computation
The construction of pseudo-random generators (PRGs) has been based on strong assumptions like the existence of one-way functions or exponential lower bounds for the circuit complexity of Boolean functions. Given our current lack of satisfactory progress towards proving these assumptions, we study the implications of constructing PRGs for weaker models of computation to the derandomization of ge...
متن کاملCOS598D Lecture 3 Pseudorandom generators from one-way functions
In this lecture we prove the existence of pseudorandom-generators assuming that one-way functions exist (Hastad, Impagliazzo, Levin and Luby '99). Our proof is with respect to non-uniform security. We also sketch the uniform case which requires a uniform version of Impagliazzo's hardcore set lemma that uses ideas from learning theory. We briefly recall some standard notions from cryptography. F...
متن کاملOn the Existence of Pseudorandom Generators
Pseudorandom generators [BM, Y] are efficient deterministic programs that expand a randomly selected k-bit seed into a much longer pseudorandom bit sequence which is indistinguishable in polynomial-time from a sequence of unbiased coin tosses. Thus, pseudorandom sequences can replace truly random sequences in all practical (i.e. polynomial-time) applications. Pseudorandom generators are known t...
متن کاملThe Power of Negations in Cryptography
The study of monotonicity and negation complexity for Boolean functions has been prevalent in complexity theory as well as in computational learning theory, but little attention has been given to it in the cryptographic context. Recently, Goldreich and Izsak (2012) have initiated a study of whether cryptographic primitives can be monotone, and showed that one-way functions can be monotone (assu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theory of Computing
دوره 8 شماره
صفحات -
تاریخ انتشار 2011